Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs
نویسندگان
چکیده
The constraint satisfaction problem (CSP) is a widely studied problem with numerous applications in computer science. For infinitedomain CSPs, there are many results separating tractable and NP-hard cases while upper bounds on the time complexity of hard cases are virtually unexplored. Hence, we initiate a study of the worst-case time complexity of such CSPs. We analyse backtracking algorithms and show that they can be improved by exploiting sparsification. We present even faster algorithms based on enumerating finite structures. Last, we prove non-trivial lower bounds applicable to many interesting CSPs, under the assumption that the strong exponential-time hypothesis is true.
منابع مشابه
Analysis of Applying Event-triggered Strategy on the Model Predictive Control
In this paper, the event-triggered strategy in the case of finite-horizon model predictive control (MPC) is studied and its advantages over the input to state stability (ISS) Lyapunov based triggering rule is discussed. In the MPC triggering rule, all the state trajectories in the receding horizon are considered to obtain the triggering rule. Clearly, the finite horizon MPC is sub-optimal with ...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملTime Complexity of Constraint Satisfaction via Universal Algebra
The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special cases of the constraint satisfaction problem (CSP), which is the problem of determining whether a set of constraints is satisfiable. In this paper we study the wor...
متن کاملOptimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP 6⊆ coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of cnf-sat with d literals per clause, to equiv...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015